Complete ( q 2 + q + 8)/2-caps in the spaces PG (3, q ), q = 2 (mod 3) an odd prime, and a complete 20-cap in PG (3, 5)
نویسندگان
چکیده
An infinite family of complete (q2 + q + 8)/2-caps is constructed in PG(3, q) where q is an odd prime ≡ 2 (mod 3), q ≥ 11. This yields a new lower bound on the second largest size of complete caps. A variant of our construction also produces one of the two previously known complete 20-caps in PG(3, 5). The associated code weight distribution and other combinatorial properties of the new (q2 + q + 8)/2-caps and the 20-cap in PG(3, 5) are investigated. The updated table of the known sizes of the complete caps in PG(3, q) is given. As a byproduct, we have found that the unique complete 14-arc in PG(2, 17) contains 10 points on a conic. Actually, this shows that an earlier general result dating back to the Seventies fails for q = 17.
منابع مشابه
Complete ( q 2 + q + 8 ) / 2 - caps in the projective space PG ( 3 , q ) with odd prime q ≡ 2 ( mod 3 )
Abstract. In the projective space PG(3, q) with odd prime q ≡ 2 (mod 3), q ≥ 11, a new infinite family of complete (q + q + 8)/2-caps is constructed. It gives a new lower bound on the second largest size m′2(3, q) of complete caps: (q 2 + q + 8)/2 ≤ m ′2(3, q). The structure of one of the two existing complete 20-caps in PG(3, 5) is described. The new upper bounds on the smallest size of comple...
متن کاملOn Sizes of Complete Caps in Projective Spaces PG(n, q) and Arcs in Planes PG(2, q)
More than thirty new upper bounds on the smallest size t2(2, q) of a complete arc in the plane PG(2, q) are obtained for 169 ≤ q ≤ 839. New upper bounds on the smallest size t2(n, q) of the complete cap in the space PG(n, q) are given for n = 3 and 25 ≤ q ≤ 97, q odd; n = 4 and q = 7, 8, 11, 13, 17; n = 5 and q = 5, 7, 8, 9; n = 6 and q = 4, 8. The bounds are obtained by computer search for new...
متن کاملNew upper bounds on the smallest size of a complete cap in the space PG(3, q)
In the projective spaces PG(3, q), more than 370 new small complete caps are obtained for q ≤ 3109, q prime. This implies new upper bounds on the smallest size t2(3, q) of a complete cap in PG(3, q). From the new bounds it follows that the relation t2(3, q) < 6q holds for q ∈ R, where R is a set of 400 prime value in the interval [2, 3109]. The new upper bounds are obtained by finding new small...
متن کاملNEW INDUCTIVE CONSTRUCTIONS OF COMPLETE CAPS IN PG ( N , q ) , q EVEN
Some new families of small complete caps in PG(N, q), q even, are described. By using inductive arguments, the problem of the construction of small complete caps in projective spaces of arbitrary dimensions is reduced to the same problem in the plane. The caps constructed in this paper provide an improvement on the currently known upper bounds on the size of the smallest complete cap in PG(N, q...
متن کاملOn Caps and Cap Partitions of Galois Projective Spaces
Let PG(N, q) be the projective space of dimension N over the finite field GF (q). A k–cap K in PG(N, q) is a set of k points, no three of which are collinear [16], and a k–cap is called complete if it is maximal with respect to set–theoretic inclusion. The maximum value of k for which there exists a k–cap in PG(N, q) is denoted by m2(N, q). This number m2(N, q) is only known, for arbitrary q, w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 50 شماره
صفحات -
تاریخ انتشار 2009